package com.sakura.哈希表;

import java.util.HashMap;

public class Code01_两数之和 {

    public int[] twoSum(int[] nums, int target) {

        // 每个位置所需要的到target的差值
        HashMap<Integer, Integer> map = new HashMap<>();

        for (int i = 0; i < nums.length; i++) {
            if (map.containsKey(target - nums[i])) {
                return new int[]{map.get(target - nums[i]), i};
            }
            map.put(nums[i], i);
        }

        return new int[]{0};

    }
}
